package practice.tmp;

import java.util.ArrayList;
import java.util.List;

public class Solution153 {
    public int findMin(int[] nums) {
        int i = 0;
        int j = nums.length - 1;
        while (i < j) {
            int mid = (i + j) >> 1;
            if (nums[mid] < nums[j]) j = mid;
            else i = mid + 1;
        }
        return nums[i];
    }
}
